منابع مشابه
Single-processor scheduling with time restrictions
Abstract We consider the following list scheduling problem. We are given a set S of jobs which are to be scheduled sequentially on a single processor. Each job has an associated processing time which is required for its processing. Given a particular permutation of the jobs in S, the jobs are processed in that order with each job started as soon as possible, subject only to the following constr...
متن کاملScheduling Deteriorating Jobs on a Single Processor
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive o...
متن کاملScheduling on a Single Processor with Variable Speed
Alidaee and Ahmadian considered a single machine scheduling problem with varying processing times, and presented a polynomial algorithm that minimizes the sum of absolute deviations of jobs’ completion times from a common due date. In this short note we remark that it is possible to eliminate one of the algorithm steps, therefore obtaining a more efficient procedure. We also show that the appro...
متن کاملOn Temperature-Aware Scheduling for Single-Processor Systems
Power-aware operating systems/processor controllers ensure that the system temperature does not exceed a threshold by utilizing system-throttling, where the clock speed is scaled to an equilibrium load. We denote this as the Constant policy, and compare against Zig-Zag policies that alternate between phases of cooling and heating. In this paper, we characterize and calculate the best possible Z...
متن کاملOrdering Problems Approximated: Single-Processor Scheduling and Interval Graph Completion
In this paper, we give the first polynomial time approximation algorithms for two problems in combinatorial optimization. The first problem is single-processor scheduling to minimize weighted sum of completion times, subject to precedence constraints. The second problem, interval graph completion, is finding a minimum-size interval graph containing the input graph as a subgraph. Both problems a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1990
ISSN: 0166-218X
DOI: 10.1016/0166-218x(90)90132-v